Method and system to implement an improved floating point adder with integrated adding and rounding

ABSTRACT

Systems and methods to implement an improved floating point adder are presented. The adder integrates adding and rounding. According to an exemplary method, of adding two floating point numbers together, a first mantissa, a second mantissa, and an input bit are added together to produce a third mantissa. The third mantissa is normalized to produce a final mantissa. The third mantissa and the final mantissa are correctly rounded as a result of the act of adding, so that the final mantissa does not require processing by a follow on rounding stage.

TECHNICAL FIELD

The present invention relates to computing and floating point arithmetic, and, more particularly, to systems and methods to implement an improved floating point adder.

BACKGROUND

The Institute of Electrical and Electronics Engineers (IEEE) specifies a standard, IEEE Std 754, for representation and conversion of exponential or floating point numbers. For example, integer numbers can be converted to exponential numbers and binary numbers can be used to represent different parts of the exponential numbers. In particular, an exponential, or floating point, number includes a sign, a significand or mantissa, and an exponent. The precision of the floating point number indicates the number of bits available to represent the floating point number; that is, the higher the precision, the more bits available. A single precision floating point number is represented by 32 bits: one bit for the sign bit, eight bits for the exponent, and 23 bits for the mantissa. For norm numbers, a bit value of one is understood to precede the 23 bits of the mantissa, becoming in effect, an implicit one most significant bit.

Floating point arithmetic is used for high-powered computing operations that require millions or billions or more of floating point operations per second (FLOPS). Basic functional building blocks such as floating point adders, multipliers and dividers are used to perform the arithmetic operations on floating point numbers. Numerous methods and systems of implementing binary adders in compliance with the IEEE 754 standard are well known in the art. A common general technique for adding two floating point numbers includes aligning and then adding the mantissas of the floating point numbers to produce an arithmetic result for a mantissa. Arriving at the final result for the mantissa and for the calculation typically involves continued shifting and aligning, followed by a final rounding step, according to, for example, the round to nearest method of IEEE Std 754.

The design of floating point arithmetic functions to manage high amounts of data throughput at ever increasing speeds and in ever reducing chip area presents challenges for designers of circuit architecture to contend with. Implementations of floating point arithmetic functional blocks, such as binary floating point adder implementations, need to become faster, more efficient, and take up less space on-chip. Accordingly, it would be desirable to provide alternative implementations and schemes that do not suffer from the drawbacks and weaknesses of existing implementations but rather that are faster, more efficient, that consume incrementally less space on chip.

SUMMARY

The presently preferred embodiments described herein include systems and methods for implementing an improved floating point adder that integrates adding and rounding.

A method of adding a first floating point number to a second floating point number is provided according to one aspect of the invention. According to the method, a first mantissa, a second mantissa, and an input bit are added together to produce a third mantissa. The third mantissa is normalized to produce a final mantissa. The third mantissa and the final mantissa are correctly rounded as a result of the act of adding.

A method of adding a first floating point number to a second floating point number is provided according to a further aspect of the invention. According to the method, a first mantissa is added to a second mantissa. A fourth mantissa is added to an input bit to round the fourth mantissa. A third mantissa is normalized. The acts of adding are integrated together within a single adder to produce the third mantissa.

A method of adding a first floating point number to a second floating point number is provided according to another aspect of the invention. According to the method, a first mantissa, a second mantissa, and an input bit are added together to produce a third mantissa and an output bit. The third mantissa is rounded by updating the input bit based on the output bit to produce a fourth mantissa. The fourth mantissa is normalized. The acts of adding and rounding are integrated within a single adder so that a separate adder to produce a correctly rounded result is not needed and so that the acts of adding and rounding are performed prior to the act of normalizing.

A method of adding a first floating point number to a second floating point number is provided according to a further aspect of the invention. According to the method, a first floating point number having a first mantissa and a second floating point number having a second mantissa are received. The first floating point number, when added to the second floating point number, produces a third floating point number having a third mantissa. The first mantissa and the second mantissa are respectively left-shifted as appropriate to obtain a fourth mantissa and a fifth mantissa. A first carry bit is produced from a second carry bit and from round control variables derived from the first mantissa and the second mantissa. The fourth mantissa, the fifth mantissa and the first carry bit are added together to produce a sixth mantissa and the second carry bit. The sixth mantissa is correctly rounded. The sixth mantissa is right-shifted to produce the third mantissa.

A floating point adder system to add a first floating point number to a second floating point number is provided according to another aspect of the invention. The system includes an adder and a shifter coupled to the adder. The adder performs an add operation to add a first mantissa, a second mantissa, and an input bit together to produce a third mantissa. The shifter normalizes the third mantissa to produce a final mantissa, The third mantissa and the final mantissa are correctly rounded as a result of the add operation performed by the adder.

BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing and other features, aspects, and advantages will become more apparent from the following detailed description when read in conjunction with the following drawings, wherein:

FIG. 1 is a diagram illustrating an exemplary floating point adder according to a first embodiment;

FIG. 2 is a diagram illustrating an exemplary floating point adder according to a second presently preferred embodiment;

FIGS. 3A and 3B are diagrams illustrating the unpack stages according to FIGS. 1 and 2; and

FIG. 4 is a diagram illustrating an exemplary floating point adder according to a third presently preferred embodiment.

DETAILED DESCRIPTION OF THE PRESENTLY PREFERRED EMBODIMENTS

The present invention will now be described in detail with reference to the accompanying drawings, which are provided as illustrative examples of preferred embodiments of the present invention.

The presently preferred embodiments described herein include systems and methods for implementing an improved floating point adder that integrates adding and rounding. Two mantissas are added together to produce a correctly rounded mantissa prior to normalization of the mantissa, making a follow on rounding stage unnecessary and conserving more space on chip. With feedback of a carry output of the adder, a less significant bit of the correctly rounded mantissa is a function of a more significant bit of the mantissa.

FIG. 1 is a diagram illustrating an exemplary floating point adder (FADD) 100 according to a first embodiment. The FADD 100 includes a swapper stage 102, a first unpack stage 104, a second unpack stage 106, a right shifter 108, a complement stage 112, an adder stage 114, a normalizer stage 116, a subtract stage 122, an increment adder stage 124, round control logic. 126, a rounding stage 128, adders 130, 132, and a left shifter 134. The normalizer stage 116 includes a count up to e₃ leading zeros stage 120 and a left shifter 118.

FIG. 2 is a diagram illustrating an exemplary floating point adder (FADD) 100 according to a second presently preferred embodiment. The FADD 200 includes the swapper stage 102, the first unpack stage 104, the second unpack stage 106, a right shifter 208, a complement stage 212, an adder stage 214, a normalizer stage 216, a subtract stage 222, an increment adder stage 224, round control logic 226, and carry logic 228. The normalizer stage 216 includes a count up to e₃ leading zeros stage 220 and a left shifter 218.

FIGS. 3A and 3B are diagrams illustrating the unpack stages 104, 106 according to FIGS. 1 and 2. The second unpack stage 106 of FIG. 3A unpacks a floating point number f₀ into a sign bit s₀, a 23 bit mantissa m₀, and an 8 bit exponent field e₀. If e₀ is equal to zero, the second unpack stage 106 supplements the mantissa m₀ with “00” to form a 25 bit mantissa m₂ and forms an 8 bit exponent field e₂ that is equal to one. If, as is far more commonly the case, e₀ is not equal to zero but is less than 255, the second unpack stage 106 supplements the mantissa m₀ with “01” to form a 25 bit mantissa m₂ and forms an 8 bit exponent field e₂ that is equal to e₀.

Similarly, the first unpack stage 104 of FIG. 3B unpacks a floating point number f₁ into a sign bit s₁, a 23 bit mantissa m₁, and an 8 exponent field e₁. If e₁ is equal to zero, the first unpack stage 104 supplements the mantissa m₁ with “00” to form a 25 bit mantissa m₃ and forms an 8 bit exponent field e₃ that is equal to one. If, as is far more commonly the case, e₁ is not equal to zero but is less than 255, the first unpack stage 104 supplements the mantissa m₁ with “01” to form a 25 bit mantissa m₃ and forms an 8 bit exponent field e₃ that is equal to e₁.

FIG. 4 is a diagram illustrating an exemplary floating point adder (FADD) 300 according to a third presently preferred embodiment. The FADD 300 includes the swapper stage 102, a first right shifter 308, a second right shifter 304, inverters 306, 310, 330, a complement stage 312, an adder stage 314, a normalizer stage 316, a subtract stage 322, an increment adder stage 324, round control logic 326, carry logic 328, and eight two input AND gates 332. The normalizer stage 316 includes a count up to e₁ leading zeros stage 320 and a left shifter 318.

Operation of the First Embodiment

Processing of the exemplary FADD 100 shown in FIG. 1 according to the first embodiment is now described. The swapper stage 102 receives two floating point numbers, i₁ and i₀, and compares theunsigned magnitudes of the numbers to determine their relative size. The number whose magnitude is less than or equal to theunsigned magnitude of the other number is designated f₀ and is processed on the right-hand side of FIG. 1. The greater or equivalent other number is designated f₁ and is processed on the left-hand side of FIG. 1. The floating point number f₀ includes a sign bit s₀ (bit 31 of 32), an eight bit exponent field e₀ (bits 30-23 of 32), and a mantissa or significand field (bits 22-0 of 32). The floating point number f₁ includes a sign bit s₁ (bit 31 of 32), an eight bit exponent field e₁ (bits 30-23 of 32), and a mantissa or significand field (bits 22-0 of 32).

The floating point numbers f₁ and f₀ are processed by the unpack stages 104, 106, respectively, as described above, so that on the left-hand side of FIG. 1, the sign bit s₁ and the eight bit exponent field e₃ are removed from f₁, leaving a 25 bit adjusted mantissa m₃, and on the right-hand side of FIG. 1, the sign bit s₀ and the eight bit exponent field e₂ are removed from f₀, leaving a 25 bit adjusted mantissa m₂.

Processing of the remaining mantissa m₃ continues downward with the introduction of two control variables, K₃ and L₃ to the adder 130. L₃ and K₃ respectively represent the least significant bit m₃[0] and the second least significant bit m₃[1] of the mantissa m₃ that serves as an input to the adder stage 114.

A control variable for the FADD 100, ADD, is calculated by applying the Boolean equivalence function to the sign bits s₁ and s₀, so that when s₁ and s₀ are both false or are both true, the floating point numbers f₀ and f₁ have the same sign, an addition operation is being performed, and ADD is true, that is, is equal to a logic one. Similarly, when s₁ and s₀ are different valued, a subtraction operation is being performed, and ADD is false, that is, is equal to a logic zero. The inverter 110 is provided to complement the ADD control variable to produce the SUB control variable which is input to the complement stage 112 and the adder 132.

Processing continues and the right shifter 108 receives and shifts the bits of the 25 bit mantissa m₂ to the right according to the value of the following control variable, RSHIFT, where RSHIFT=e ₃ −e ₂. Accordingly, if RSHIFT is equal to zero, the mantissa m₂ is not shifted. The right shifter 108 produces a 25 bit mantissa m₄ as well as a series of control variables K₄, L₄, G₄, R₄, and S₄. TABLE I is a truth table for generation of K₄, L₄, G₄, R₄, and S₄ within the right shifter 108 given the value of the control variable RSHIFT. For example, if RSHIFT is equal to 23, then K₄ is equal to the most significant bit m₂[24] of the mantissa m₂, that is, K₄ is False. The control variables L₄ and K₄ respectively represent the least significant bit m₄[0] and the second least significant bit m₄[1] of the mantissa m₄.

TABLE I Truth Table for Generation of J₄, K₄, L₄, G₄, R₄ and S₄ within Right Shifters 108, 208 (FIGS. 1 and 2) where | = OR; and m₂ [i] is the ith digit of m₂ RSHIFT J₄ K₄ L₄ G₄ R₄ S₄ 0 False m₂[1] m₂[0] False False False 1 False m₂[2] m₂[1] m₂[0] False False 2 False m₂[3] m₂[2] m₂[1] m₂[0] False 3 False m₂[4] m₂[3] m₂[2] m₂[1] m₂[0] 4 False m₂[5] m₂[4] m₂[3] m₂[2] (m₂[1] | m₂[0]) 5 False m₂[6] m₂[5] m₂[4] m₂[3] (m₂[2] | m₂[1] | m₂[0]) 6 False m₂[7] m₂[6] m₂[5] m₂[4] (m₂[3] | . . . | m₂[0]) 7 False m₂[8] m₂[7] m₂[6] m₂[5] (m₂[4] | . . . | m₂[0]) 8 False m₂[9] m₂[8] m₂[7] m₂[6] (m₂[5] | . . . | m₂[0]) 9 False m₂[10] m₂[9] m₂[8] m₂[7] (m₂[6] | . . . | m₂[0]) 10 False m₂[11] m₂[10] m₂[9] m₂[8] (m₂[7] | . . . | m₂[0]) 11 False m₂[12] m₂[11] m₂[10] m₂[9] (m₂[8] | . . . | m₂[0]) 12 False m₂[13] m₂[12] m₂[11] m₂[10] (m₂[9] | . . . | m₂[0]) 13 False m₂[14] m₂[13] m₂[12] m₂[11] (m₂[10] | . . . | m₂[0]) 14 False m₂[15] m₂[14] m₂[13] m₂[12] (m₂[11] | . . . | m₂[0]) 15 False m₂[16] m₂[15] m₂[14] m₂[13] (m₂[12] | . . . | m₂[0]) 16 False m₂[17] m₂[16] m₂[15] m₂[14] (m₂[13] | . . . | m₂[0]) 17 False m₂[18] m₂[17] m₂[16] m₂[15] (m₂[14] | . . . | m₂[0]) 18 False m₂[19] m₂[18] m₂[17] m₂[16] (m₂[15] | . . . | m₂[0]) 19 False m₂[20] m₂[19] m₂[18] m₂[17] (m₂[16] | . . . | m₂[0]) 20 False m₂[21] m₂[20] m₂[19] m₂[18] (m₂[17] | . . . | m₂[0]) 21 False m₂[22] m₂[21] m₂[20] m₂[19] (m₂[18] | . . . | m₂[0]) 22 False m₂[23] m₂[22] m₂[21] m₂[20] (m₂[19] | . . . | m₂[0]) 23 False False m₂[23] m₂[22] m₂[21] (m₂[20] | . . . | m₂[0]) 24 False False False m₂[23] m₂[22] (m₂[21] | . . . | m₂[0]) 25 False False False False m₂[23] (m₂[22] | . . . | m₂[0]) 26 False False False False False (m₂[23] | . . . | m₂[0]) ≦27 False False False False False (m₂[23] | . . . | m₂[0])

At the complement stage 112, if SUB is False, then ADD is True and an addition is being preformed and none of the inputs to the complement stage 112 are complemented. If, however, SUB is True, each binary digit of the mantissa m₄ as well as each of the control variables K₄, L₄, G₄, R₄, and S₄ are complemented by the complement stage 112. The operation of the complement stage 112 is summarized as follows: m₆={m₆[24], m₆[23], . . . , m₆[1], m₆[0]}={m₄[24]^SUB, m₄[23]^SUB, . . . , m₄[2]^SUB, m₄[1]^SUB}, K₆=K₄^SUB=m₄[1]^SUB=m₆[1], L₆=L₄^SUB=m₄[0]^SUB=m₆[0], G₆=G₄^SUB, R₆=R₄^SUB, and S₆=S₄^SUB where ^ represents the Boolean exclusive-or operation. The 25 bit mantissa m₆ produced by the complement stage 112 serves as another input to the adder stage 114. The control variables K₆ and L₆ are input to the adder 130 and the control variables G₆, R₆, and S₆ are input the adder 132.

TABLE II is a truth table for generation of Cin, G₈, R₈, and S₈ within the adder 132 given the values of the control variable SUB and the input control variables G₆, R₆, and S₆. For example, if SUB is True, and G₆, R₆, and S₆ are all True, then G₈, R₈, and S₈ are all False and the overflow bit Cin is True. The signal Cin serves as a carry input to the adder stage 114 as well as the adder 130.

TABLE II Truth Table for Generation of Cin, G₈, R₈, and S₈ within Adder 132 (FIG. 1) SUB = ~ADD Cin (Adder (Adder 132 G₆ R₆ S₆ G₈ R₈ S₈ 132 Carry Carry In Bit) (Adder 132 Input) (Adder 132 Sum) Out Bit) False False False False False False False False False False False True False False True False False False True False False True False False False False True True False True True False False True False False True False False False False True False True True False True False False True True False True True False False False True True True True True True False True False False False False False True False True False False True False True False False True False True False False True True False True False True True True False False False True True False False True False True False True True False True True True False False True True True False True True True False True True True True False False False True Cin = SUB & G₆ & R₆ & S₆ where & = AND; and ~ = NOT

TABLE III is a truth table for generation of K₈ and L₈ within the adder 130 given the values of Cin from the adder 132 and of the pairs of input control variables K₃, L₃ and K₆, L₆. For example, if Cin is False, and K₃, L₃ and K₆, L₆ are all True, then K₈ and L₈ are True and False, respectively. The control variables K₈ and L₈ join with G₈, R₈, and S₈ to form a 5 bit word that is input to the left shifter 134.

TABLE III Truth Table for Generation of K₈ and L₈ within Adder 130 (FIG. 1) Cin K₃ L₃ K₆ L₆ K₈ L₈ (Adder 130 (Adder 130 First (Adder 130 Second (Adder 130 Sum Carry In Bit) Input) Input) Input) 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 0 1 1 1 1 0 0 1 0 0 0 1 0 0 1 0 1 1 0 0 0 1 1 0 1 1 0 0 1 1 1 0 0 0 1 0 0 0 1 0 0 1 0 0 1 1 1 0 1 0 1 0 0 0 0 1 0 1 1 0 1 0 1 1 0 0 1 1 0 1 1 0 1 0 0 0 1 1 1 0 0 1 0 1 1 1 1 1 0 1 0 0 0 0 0 1 1 0 0 0 1 1 0 1 0 0 1 0 1 1 1 0 0 1 1 0 0 1 0 1 0 0 1 0 1 0 1 0 1 1 1 1 0 1 1 0 0 0 1 0 1 1 1 0 1 1 1 0 0 0 1 1 1 1 0 0 1 0 0 1 1 0 1 0 0 1 1 1 0 1 1 1 0 1 1 1 0 0 0 0 1 1 1 0 1 0 1 1 1 1 1 0 1 0 1 1 1 1 1 1 1

The adder stage 114 receives the 25 bit mantissa m₃, the 25 bit mantissa m₆, and the Cin bit signal and adds these together to produce a 25 bit mantissa m₇. The carry out bit of the adder stage 114 is discarded and is not used to obtain the final result of the FADD 100.

Processing continues to the normalizer stage 116, which receives the 25 bit mantissa m₇ the control variable G₈ from the adder 132. The count up to e₃ leading zeros stage 120 examines each bit of the mantissa m₇ beginning with the most significant bit m₇[24] and counts logic zeros until the stage 120 counts e₃ logic zeros, until the stage 120 encounters a logic one, or until the 25 bits of the mantissa m₇ are exhausted, whichever comes first. The stage 120 outputs a control variable LSHIFT that is equal to the number of counted leading logic zeros in the mantissa m₇. The left shifter 118 receives and shifts the bits of the 25 bit mantissa m₇ to the left to produce a 25 bit mantissa m₁₁ according to the value of the control variable, LSHIFT. Accordingly, if LSHIFT is equal to zero, the mantissa m₇ is not shifted and the mantissa m₁₁ equals the mantissa m₇. If LSHIFT is equal to one, then the control variable G₈ is shifted in to become the least significant bit of the mantissa m₁₁. If LSHIFT is greater than one, the control variable G₈ is shifted in, followed by LSHIFT-1 logic zeros, to form the latter part of the mantissa m₁₀.

Returning to the left shifter 134, the shifter 134 receives the 5 bit word consisting of the control variables K₈, L₈, G₈, R₈, and S₈ and shifts the bits of the 5 bit word to the left to produce a 5 bit word that consists of the control variables K₁₀, L₁₀, G₁₀, R₁₀, and S₁₀, according to the value of the control variable, LSHIFT. TABLE IV is a truth table for generation of K₁₀, L₁₀, G₁₀, R₁₀, and S₁₀ within the left shifter 134 given the values of the control variable LSHIFT and the input control variables K₈, L₈, G₈, R₈,and S₈. For example, if LSHIFT is equal to three, then K₁₀ is equal to R₈, L₁₀ is equal to S₈, and G₁₀, R₁₀, and S₁₀ are all False. The 5 bit word of K₁₀ L₁₀ G₁₀ R₁₀ S₁₀ serves as the input to the round control logic 126.

TABLE IV Truth Table for Generation of K₁₀, L₁₀, G₁₀, R₁₀ and S₁₀ within Left Shifter 134 (FIG. 1) where | = OR LEFT SHIFT (integer value of 8 bit number) K₁₀ L₁₀ G₁₀ R₁₀ S₁₀ 0 K₈ L₈ G₈ R₈ S₈ 1 L₈ G₈ R₈ S₈ False 2 G₈ R₈ S₈ False False 3 R₈ S₈ False False False 4 S₈ False False False False 5 to e₃ False False False False False

Next, the round control logic 126 receives the control variables K₁₀, L₁₀, G₁₀, R₁₀, and S₁₀. TABLE V is a truth table for generation of the control signal increment (INC) within the round control logic 126 given the values of the input control variables K₁₀, L₁₀, G₁₀, R₁₀, and S₁₀. For example, if K₁₀ and S₁₀ are False and L₁₀, G₁₀, and R₁₀ are True, then INC is True. The signal INC serves as a carry input to the rounding stage 128.

TABLE V Truth Table for Generation of INC within Round Control Logic 126 (FIG. 1) K₁₀ L₁₀ G₁₀ R₁₀ S₁₀ INC False False False False False False False False False False True False False False False True False False False False False True True False False False True False False False False False True False True False False False True True False False False False True True True False False True False False False True False True False False True True False True False True False True False True False True True True False True True False False True False True True False True True False True True True False True False True True True True True True False False False False False True False False False True False True False False True False False True False False True True False True False True False False False True False True False True False True False True True False False True False True True True True True True False False False True True True False False True True True True False True False True True True False True True True True True True False False True True True True False True True True True True True False True True True True True True True

Processing of the mantissa m₁₁ continues downward with the removal of the least significant bit m₁₁[0] from the mantissa m₁₁ to produce a 24 bit mantissa m₁₂. The rounding stage 128 adds the signal INC to the mantissa m₁₂ to produce a 24 bit mantissa m₁₃. The rounding stage 128 is in effect an additional adder stage that follows the normalizer stage 116.

Next, the most significant bit of the 24 bit mantissa m₁₃ is removed to produce the 23 bit mantissa m of the floating point number f_(result) output of the FADD 100. The most significant bit serves as an input to the increment adder stage 124.

The subtract stage 122 subtracts the 8 bit control variable LSHIFT from the 8 bit exponent field value e₃ from the unpack stage 104 and produces an 8 bit output that is in turn sent to the increment adder stage 124. The increment adder stage 124 adds the 8 bit output of the subtract stage 122 to the one bit most significant bit described above to produce the 8 bit exponent field e of the floating point number f_(result). The sign bit s1 of the floating point number f₁ becomes the sign bit s of the floating point number f_(result). All parts s, e, and m of the floating point number f_(result) are thus known and processing of the FADD 100 terminates.

Operation of the Second Embodiment

Processing of the exemplary FADD 200 shown in FIG. 2 according to the second embodiment is now described. The swapper stage 102 receives two floating point numbers, i₁ and i₀, and compares theunsigned magnitude of the numbers to determine their relative size. The number whose magnitude is less than or equal to theunsigned magnitude of the other number is designated f₀ and is processed on the right-hand side of FIG. 2. The greater or equivalent other number is designated f₁ and is processed on the left-hand side of FIG. 2. The floating point number f₀ includes a sign bit s₀ (bit 31 of 32), an eight bit exponent field e₀ (bits 30-23 of 32), and a mantissa or significand field (bits 22-0 of 32). The floating point number f₁ includes a sign bit s₁ (bit 31 of 32), an eight bit exponent field e₁ (bits 30-23 of 32), and a mantissa or significand field (bits 22-0 of 32).

The floating point numbers f₁ and f₀ are processed by the unpack stages 104, 106, respectively, as described above, so that on the left-hand side of FIG. 2, the sign bit s₁ and the eight bit exponent field e₃ are removed from f₁, leaving a 25 bit adjusted mantissa m₃, and on the right-hand side of FIG. 2, the sign bit s₀ and the eight bit exponent field e₂ are removed from f₀, leaving a 25 bit adjusted mantissa m₂.

Processing of the remaining mantissa m₃ continues downward with the introduction of three control variables, J₃, K₃, and L₃ to the round control logic 226. J₃, L₃, and K₃ respectively represent the most significant bit m₃[24], the least significant bit m₃[0], and the second least significant bit m₃[1] of the mantissa m₃ that serves as an input to the adder stage 214.

A control variable for the FADD 200, ADD, is calculated by applying the Boolean equivalence function to the sign bits s₁ and s₀, so that when s₁ and s₀ are both false or are both true, the floating point numbers f₀ and f₁ have the same sign, an addition operation is being performed, and ADD is true, that is, is equal to a logic one. Similarly, when s₁ and s₀ are different valued, a subtraction operation is being performed, and ADD is false, that is, is equal to a logic zero. The inverter 210 is provided to complement the ADD control variable to produce the SUB control variable which is input to the complement stage 212 and the round control logic 226.

Processing continues and the right shifter 208 receives and shifts the bits of the 25 bit mantissa m₂ to the right according to the value of the following control variable, RSHIFT, where RSHIFT=e ₃ −e ₂. Accordingly, if RSHIFT is equal to zero, the mantissa m₂ is not shifted. The right shifter 208 produces a 25 bit mantissa m₄ as well as a series of control variables J₄, K₄, L₄, G₄, R₄, and S₄. TABLE I is a truth table for generation of J₄, K₄, L₄, G₄, R₄, and S₄ within the right shifter 208 given the value of the control variable RSHIFT. For example, if RSHIFT is equal to 23, then K₄ is equal to the most significant bit m₂[24] of the mantissa m₂, that is, K₄ is False. The control variables J₄, L₄, and K₄ respectively represent the most significant bit m₄[24], the least significant bit m₄[0], and the second least significant bit m₄[1] of the mantissa m₄.

At the complement stage 212, if SUB is False, then ADD is True and an addition is being performed and none of the inputs to the complement stage 212 are complemented. If, however, SUB is True, each binary digit of the mantissa m₄ as well as each of the control variables J₄, K₄, L₄, G₄, R₄, and S₄ are complemented by the complement stage 212. The operation of the complement stage 212 is summarized as follows: m₆={m₆[24], m₆[23], . . . , m₆[1], m₆[0]}={m₄[24]^SUB, m₄[23]^SUB, . . . , m₄[2]^SUB, m₄[1]^SUB}, J₆=J₄^SUB=m₄[24]^SUB=m₆[24], K₆=K₄^SUB=m₄[1]^SUB=m₆[1], L₆=L₄^SUB=m₄[0]^SUB=m₆[0], G₆=G₄^SUB, R₆=R₄^SUB, and S₆=S₄^SUB where ^ represents the Boolean exclusive-or operation. The 25 bit mantissa m₆ produced by the complement stage 212 serves as another input to the adder stage 214. The control variable outputs J₆, K₆, L₆, G₆, R₆, and S₆ of the complement stage 212 are input to the round control logic 226.

TABLE VI is a truth table for generation of internal control variables L and K within the round control logic 226 given the values of the input control variables K₃, K₆, L₃, and L₆. For example, if K₃, K₆, L₃, and L₆ are all true, then L and K are False and True, respectively.

TABLE VI Truth Table for Generation of L and K within Round Control Logic 226 (FIG. 2); K = K₃ {circumflex over ( )} K₆ {circumflex over ( )} (L₃ & L₆); L = L₃ {circumflex over ( )} L₆ where {circumflex over ( )} = EXCLUSIVE-OR; and & = AND K₃ K₆ L₃ L₆ L K False False False False False False False False False True True False False False True False True False False False True True False True False True False False False True False True False True True True False True True False True True False True True True False False True False False False False True True False False True True True True False True False True True True False True True False False True True False False False False True True False True True False True True True False True False True True True True False True

TABLE VII is a truth table for generation of the control variables GEN, PROP and G₈ within the round control logic 226 given the values of the internal control variables K and L shown in TABLE VI and of the input control variables SUB, J₃, J₆, G₆, R₆, and S₆. For example, if J₃, J₆, SUB, K, L, G₆, R₆, and S₆ are all True, then GEN and PROP are both True and G₈ is False. The control variables GEN and PROP are input to the carry logic 228. G₈ serves as an input to the left shifter 218 of the normalizer stage 216. TABLE VII also explains the generation of the signal Cin within the carry logic 228 given the values of the control variables GEN and PROP from the round control logic 226. Similarly, TABLE VIII is a truth table for generation of the signal Cin within the carry logic 228 given the values of the control variables GEN and PROP and the signal C23 from the adder stage 214. C23 is the second most significant carry bit of the adder stage 214, with C24 or Cout representing the most significant carry bit of the adder stage 214. For example, if GEN is False and PROP is True, then Cin follows the value of C23. If GEN and PROP are both False, then Cin is False. Finally, if GEN is True, then Cin is True.

TABLE VII Truth Table for Generation of GEN, PROP, and G₈ within Round Control Logic 226 and Cin within Carry Logic 228 (FIG. 2); GEN = (~SUB & ~G₆ & (L | ~R₆ | ~S₆)) | (SUB & G₆ & (R₆ | S₆)) | (~J₆ & ~SUB & K & L); PROP = (~J₃ & ~SUB & L & (K |~R₆ |~S₆)) | (L & ~G₆ & R₆ & S₆) | (SUB & G₆); G₈ = (~G₆ & R₆) | (G₆ & ~R₆ & ~S₆) where & = AND; | = OR; and ~ = NOT; DC = Don't Care J₃ J₆ SUB K L G₆ R₆ S₆ GEN PROP G₈ Cin False False False False False False False False False False DC False False False False False False False False True False False DC False False False False False False False True False False False DC False False False False False False False True True False False DC False False False False False False True False False False False DC False False False False False False True False True True False DC True False False False False False True True False True False DC True False False False False False True True True True False DC True False False False False True False False False False False DC False False False False False True False False True False True DC C23 False False False False True False True False False True DC C23 False False False False True False True True False True DC C23 False False False False True True False False True True DC True False False False False True True False True True True DC True False False False False True True True False True True DC True False False False False True True True True True True DC True False False False True False False False False False False DC False False False False True False False False True False False DC False False False False True False False True False False False DC False False False False True False False True True False False DC False False False False True False True False False False False DC False False False False True False True False True True False DC True False False False True False True True False True False DC True False False False True False True True True True False DC True False False False True True False False False True True DC True False False False True True False False True True True DC True False False False True True False True False True True DC True False False False True True False True True True True DC True False False False True True True False False True True DC True False False False True True True False True True True DC True False False False True True True True False True True DC True False False False True True True True True True True DC True False False True False False False False False False False False False False False True False False False False True False False False False False False True False False False True False False False True False False False True False False False True True False False True False False False True False False True False False False True True C23 False False True False False True False True True True False True False False True False False True True False True True False True False False True False False True True True True True False True False False True False True False False False False False False False False False True False True False False True False False False False False False True False True False True False False False True False False False True False True False True True False True True C23 False False True False True True False False False True True C23 False False True False True True False True True True False True False False True False True True True False True True False True False False True False True True True True True True False True False False True True False False False False False False False False False False True True False False False True False False False False False False True True False False True False False False True False False False True True False False True True False False True False False False True True False True False False False True True C23 False False True True False True False True True True False True False False True True False True True False True True False True False False True True False True True True True True False True False False True True True False False False False False False False False False True True True False False True False False False False False False True True True False True False False False True False False False True True True False True True False True True C23 False False True True True True False False False True True C23 False False True True True True False True True True False True False False True True True True True False True True False True False False True True True True True True True True False True False True False False False False False False False False DC False False True False False False False False True False False DC False False True False False False False True False False False DC False False True False False False False True True False False DC False False True False False False True False False False False DC False False True False False False True False True True False DC True False True False False False True True False True False DC True False True False False False True True True True False DC True False True False False True False False False False False DC False False True False False True False False True False True DC C23 False True False False True False True False False True DC C23 False True False False True False True True False True DC C23 False True False False True True False False True True DC True False True False False True True False True True True DC True False True False False True True True False True True DC True False True False False True True True True True True DC True False True False True False False False False False False DC False False True False True False False False True False False DC False False True False True False False True False False False DC False False True False True False False True True False False DC False False True False True False True False False False False DC False False True False True False True False True True False DC True False True False True False True True False True False DC True False True False True False True True True True False DC True False True False True True False False False False True DC C23 False True False True True False False True False True DC C23 False True False True True False True False False True DC C23 False True False True True False True True False True DC C23 False True False True True True False False True True DC True False True False True True True False True True True DC True False True False True True True True False True True DC True False True False True True True True True True True DC True False True True False False False False False False False False False False True True False False False False True False False False False False True True False False False True False False False True False False True True False False False True True False False True False False True True False False True False False False True True C23 False True True False False True False True True True False True False True True False False True True False True True False True False True True False False True True True True True False True False True True False True False False False False False False False False True True False True False False True False False False False False True True False True False True False False False True False False True True False True False True True False True True C23 False True True False True True False False False True True C23 False True True False True True False True True True False True False True True False True True True False True True False True False True True False True True True True True True False True False True True True False False False False False False False False False True True True False False False True False False False False False True True True False False True False False False True False False True True True False False True True False False True False False True True True False True False False False True True C23 False True True True False True False True True True False True False True True True False True True False True True False True False True True True False True True True True True False True False True True True True False False False False False False False False True True True True False False True False False False False False True True True True False True False False False True False False True True True True False True True False True True C23 False True True True True True False False False True True C23 False True True True True True False True True True False True False True True True True True True False True True False True False True True True True True True True True True False True True False False False False False False False False False DC False True False False False False False False True False False DC False True False False False False False True False False False DC False True False False False False False True True False False DC False True False False False False True False False False False DC False True False False False False True False True True False DC True True False False False False True True False True False DC True True False False False False True True True True False DC True True False False False True False False False False False DC False True False False False True False False True False False DC False True False False False True False True False False False DC False True False False False True False True True False False DC False True False False False True True False False True True DC True True False False False True True False True True False DC True True False False False True True True False True False DC True True False False False True True True True True False DC True True False False True False False False False False False DC False True False False True False False False True False False DC False True False False True False False True False False False DC False True False False True False False True True False False DC False True False False True False True False False False False DC False True False False True False True False True True False DC True True False False True False True True False True False DC True True False False True False True True True True False DC True True False False True True False False False True False DC True True False False True True False False True True False DC True True False False True True False True False True False DC True True False False True True False True True True False DC True True False False True True True False False True True DC True True False False True True True False True True False DC True True False False True True True True False True False DC True True False False True True True True True True False DC True True False True False False False False False False False False False True False True False False False False True False False False False True False True False False False True False False False True False True False True False False False True True False False True False True False True False False True False False False True True C23 True False True False False True False True True True False True True False True False False True True False True True False True True False True False False True True True True True False True True False True False True False False False False False False False True False True False True False False True False False False False True False True False True False True False False False True False True False True False True False True True False True True C23 True False True False True True False False False True True C23 True False True False True True False True True True False True True False True False True True True False True True False True True False True False True True True True True True False True True False True True False False False False False False False False True False True True False False False True False False False False True False True True False False True False False False True False True False True True False False True True False False True False True False True True False True False False False True True C23 True False True True False True False True True True False True True False True True False True True False True True False True True False True True False True True True True True False True True False True True True False False False False False False False True False True True True False False True False False False False True False True True True False True False False False True False True False True True True False True True False True True C23 True False True True True True False False False True True C23 True False True True True True False True True True False True True False True True True True True False True True False True True False True True True True True True True True False True True True False False False False False False False False DC False True True False False False False False True False False DC False True True False False False False True False False False DC False True True False False False False True True False False DC False True True False False False True False False False False DC False True True False False False True False True True False DC True True True False False False True True False True False DC True True True False False False True True True True False DC True True True False False True False False False False False DC False True True False False True False False True False False DC False True True False False True False True False False False DC False True True False False True False True True False False DC False True True False False True True False False True True DC True True True False False True True False True True False DC True True True False False True True True False True False DC True True True False False True True True True True False DC True True True False True False False False False False False DC False True True False True False False False True False False DC False True True False True False False True False False False DC False True True False True False False True True False False DC False True True False True False True False False False False DC False True True False True False True False True True False DC True True True False True False True True False True False DC True True True False True False True True True True False DC True True True False True True False False False False False DC False True True False True True False False True False False DC False True True False True True False True False False False DC False True True False True True False True True False False DC False True True False True True True False False True True DC True True True False True True True False True True False DC True True True False True True True True False True False DC True True True False True True True True True True False DC True True True True False False False False False False False False False True True True False False False False True False False False False True True True False False False True False False False True False True True True False False False True True False False True False True True True False False True False False False True True C23 True True True False False True False True True True False True True True True False False True True False True True False True True True True False False True True True True True False True True True True False True False False False False False False False True True True False True False False True False False False False True True True False True False True False False False True False True True True False True False True True False True True C23 True True True False True True False False False True True C23 True True True False True True False True True True False True True True True False True True True False True True False True True True True False True True True True True True False True True True True True False False False False False False False False True True True True False False False True False False False False True True True True False False True False False False True False True True True True False False True True False False True False True True True True False True False False False True True C23 True True True True False True False True True True False True True True True True False True True False True True False True True True True True False True True True True True False True True True True True True False False False False False False False True True True True True False False True False False False False True True True True True False True False False False True False True True True True True False True True False True True C23 True True True True True True False False False True True C23 True True True True True True False True True True False True True True True True True True True False True True False True True True True True True True True True True True False True

TABLE VIII Truth Table for Generation of Cin within Carry Logic 228 (FIG. 2); GEN PROP C23 Cin False False False False False False True False False True False False False True True True True False False True True False True True True True False True True True True True Cin = GEN | (PROP & C23) where & = AND; | = OR

The adder stage 214 receives the 25 bit mantissa m₃, the 25 bit mantissa m₆, and the Cin bit signal and adds these together to produce a 25 bit mantissa m₇. The second most significant carry bit C23 of the adder stage 214 is fed back to the carry logic 228 as described above. Thus, the input carry bit Cin to the adder stage 214 is a function of the carry bit C23 of the adder stage 214.

Processing continues to the normalizer stage 216, which receives the 25 bit mantissa m₇ and the control variable G₈ from the round control logic 226. The count up to e₃ leading zeros stage 220 examines each bit of the mantissa m₇ beginning with the most significant bit m₇[24] and counts logic zeros until the stage 220 counts e₃ logic zeros, until the stage 220 encounters a logic one, or until the 25 bits of the mantissa m₇ are exhausted, whichever comes first. The stage 220 outputs a control variable LSHIFT that is equal to the number of counted leading logic zeros in the mantissa m₇. The left shifter 218 receives and shifts the bits of the 25 bit mantissa m₇ to the left to produce a 25 bit mantissa m₁₀ according to the value of the control variable, LSHIFT. Accordingly, if LSHIFT is equal to zero, the mantissa m₇ is not shifted and the mantissa m₁₀ equals the mantissa m₇. If LSHIFT is equal to one, then the control variable G₈ is shifted in to become the least significant bit of the mantissa m₁₀. If LSHIFT is greater than one, the control variable G₈ is shifted in, followed by LSHIFT-1 logic zeros, to form the latter part of the mantissa m₁₀.

Processing of the mantissa m₁₀ continues downward with the removal of the least significant bit m₁₀[0] from the mantissa m₁₀. Next, the most significant bit of the resulting 24 bit mantissa is removed to produce the 23 bit mantissa m of the floating point number f_(result) output of the FADD 200. The most significant bit serves as an input to the increment adder stage 224.

The subtract stage 222 subtracts the 8 bit control variable LSHIFT from the 8 bit exponent field value e₃ from the unpack stage 104 and produces an 8 bit output that is in turn sent to the increment adder stage 224. The increment adder stage 224 adds the 8 bit output of the subtract stage 222 to the one bit most significant bit described above to produce the 8 bit exponent field e of the floating point number f_(result), The sign bit s1 of the floating point number f₁ becomes the sign bit s of the floating point number f_(result). All parts s, e, and m of the floating point number f_(result) are thus known and processing of the FADD 200 terminates.

Operation of the Third Embodiment

Processing of the exemplary FADD 300 shown in FIG. 4 according to the third embodiment is now described. The swapper stage 102 receives two floating point numbers, i₁ and i₀, and compares theunsigned magnitude of the numbers to determine their relative size. Theunsigned number that is less than or equal to the otherunsigned number is designated f₀ and is processed on the right-hand side of FIG. 4. The greater or equivalent otherunsigned number is designated f₁ and is processed on the left-hand side of FIG. 4. The floating point number f₀ includes a sign bit s₀ (bit 31 of 32), an eight bit exponent field e₀ (bits 30-23 of 32), and a mantissa or significand field (bits 22-0 of 32). The floating point number f₁ includes a sign bit s₁ (bit 31 of 32), an eight bit exponent field e₁ (bits 30-23 of 32), and a mantissa or significand field (bits 22-0 of 32).

On the left-hand side of FIG. 4, the sign bit s₁ and the eight bit exponent field e₁ are removed from f₁. Processing of the remaining mantissa continues downward with the introduction of a guard bit G₁ having a value of logic zero and an implicit one bit, producing a 25 bit mantissa m₁.

On the right-hand side of FIG. 4, the sign bit s₀ and the eight bit exponent field e₀ are removed from f₀. Processing of the remaining mantissa continues downward with the introduction of an implicit one bit, producing a 24 bit mantissa m₀. The implicit one bit is the most significant bit m₀[23] of the mantissa m₀.

A control variable for the FADD 300, ADD, is calculated by applying the Boolean equivalence function to the sign bits s₁ and s₀, so that when s₁ and s₀ are both false or are both true, the floating point numbers f₀ and f₁ have the same sign, an addition operation is being performed, and ADD is true, that is, is equal to a logic one. Similarly, when s₁ and s₀ are different valued, a subtraction operation is being performed, and ADD is false, that is, is equal to a logic zero. The inverter 310 is provided to complement the ADD control variable to produce the SUB control variable which is input to the complement stage 312 and the round control logic 326.

On the left-hand side of FIG. 4, processing continues at the second right shifter 304, which receives the control variable ADD. If ADD=True, then the second right shifter 304 shifts the mantissa m₁ to the right by one to produce a mantissa m₃ so that m₃={m₃[24], m₃[23], . . . , m₃[1], m₃[0]}={0, m₁[24]=1, m₁[23], . . . , m₁[2], m₁[1]}. If ADD=False, then m₁ passes through the second right shifter 304 without any change so that m₃ is equal to m₁.

Processing of the mantissa m₃ continues downward with the introduction of two control variables, L₃ and G₃ to the round control logic 326. G₃ and L₃ respectively represent the least significant bit m₃[0], and the second least significant bit m₃[1] of the mantissa m₃. Next, the guard bit G₃ of m₃, that is, m₃[0], is removed and a new guard bit G₅ generated from the round control logic 326 is added as the new least significant bit to produce a mantissa m₅. The most significant bit of m₅, m₅[24], is complemented by the inverter 306 and returned as the new most significant bit to form a mantissa m₇ that serves as an input to the adder stage 314.

Returning to the right-hand side of FIG. 4, the first right shifter 308 receives and shifts the bits of the 24 bit mantissa m₀ to the right according to the value of the following control variable, RSHIFT, where RSHIFT=e ₁ −e ₀ +ADD. Accordingly, if RSHIFT is equal to zero mantissa m₀ is not shifted. The first right shifter 308 produces a 25 bit mantissa m₂ as well as a series of control variables L₂, G₂, R₂, and S₂. TABLE IX is a truth table for generation of L₂, G₂, R₂, and S₂ within the first right shifter 308 given the value of the control variable RSHIFT. For example, if RSHIFT is equal to 23, then L₂ is equal to the most significant bit m₀[23] of the mantissa m₀, that is, L₂ is True. The control variables G₂ and L₂ respectively represent the least significant bit m₂[0], and the second least significant bit m₂[1] of the mantissa m₂.

TABLE IX Truth Table for Generation of L₂, G₂, R₂ and S₂ within Right Shifter 308 (FIG. 4) where | = OR; and m₀ [i] is the ith digit of m₀ RSHIFT L₂ G₂ R₂ S₂ 0 m₀[0] False False False 1 m₀[1] m₀[0] False False 2 m₀[2] m₀[1] m₀[0] False 3 m₀[3] m₀[2] m₀[1] m₀[0] 4 m₀[4] m₀[3] m₀[2] (m₀[1] |m₀[0]) 5 m₀[5] m₀[4] m₀[3] (m₀[2] |m₀[1] | m₀[0]) 6 m₀[6] m₀[5] m₀[4] (m₀[3] | . . . | m₀[0]) 7 m₀[7] m₀[6] m₀[5] (m₀[4] | . . . | m₀[0]) 8 m₀[8] m₀[7] m₀[6] (m₀[5] | . . . | m₀[0]) 9 m₀[9] m₀[8] m₀[7] (m₀[6] | . . . | m₀[0]) 10 m₀[10] m₀[9] m₀[8] (m₀[7] | . . . | m₀[0]) 11 m₀[11] m₀[10] m₀[9] (m₀[8] | . . . | m₀[0]) 12 m₀[12] m₀[11] m₀[10] (m₀[9] | . . . | m₀[0]) 13 m₀[13] m₀[12] m₀[11] (m₀[10] | . . . | m₀[0]) 14 m₀[14] m₀[13] m₀[12] (m₀[11] | . . . | m₀[0]) 15 m₀[15] m₀[14] m₀[13] (m₀[12] | . . . | m₀[0]) 16 m₀[16] m₀[15] m₀[14] (m₀[13] | . . . | m₀[0]) 17 m₀[17] m₀[16] m₀[15] (m₀[14] | . . . | m₀[0]) 18 m₀[18] m₀[17] m₀[16] (m₀[15] | . . . | m₀[0]) 19 m₀[19] m₀[18] m₀[17] (m₀[16] | . . . | m₀[0]) 20 m₀[20] m₀[19] m₀[18] (m₀[17] | . . . | m₀[0]) 21 m₀[21] m₀[20] m₀[19] (m₀[18] | . . . | m₀[0]) 22 m₀[22] m₀[21] m₀[20] (m₀[19] | . . . | m₀[0]) 23 True m₀[22] m₀[21] (m₀[20] | . . . | m₀[0]) 24 False True m₀[22] (m₀[21] | . . . | m₀[0]) 25 False False True (m₀[22] | . . . | m₀[0]) ≦26 False False False True

At the complement stage 312, if SUB is False, then ADD is True and an addition is being performed and none of the inputs to the complement stage 312 are complemented. If, however, SUB is True, each binary digit of the mantissa m₂ as well as each of the control variables L₂, G₂, R₂, and S₂ are complemented by the complement stage 312. The operation of the complement stage 312 is summarized as follows: m₄={m₄[24], m₄[23], . . . , m₄[1], m₄[0]}={m₂[24]^SUB, m₂[23]^SUB, . . . , m₂[2]^SUB, m₂[1]^SUB}, L₄=L₂^SUB=m₂[1]^SUB=m₄[1], G₄=G₂^SUB=m₂[0]^SUB=m₄[0], R₄=R₂^SUB, and S₄=S₂^SUB where ^ represents the Boolean exclusive-or operation. The 25 bit mantissa m₄ produced by the complement stage 312 serves as another input to the adder stage 314. The control variable outputs L₄, G₄, R₄, and S₄ of the complement stage 312 are input to the round control logic 326.

TABLE X is a truth table for generation of internal control variables G, L, and G₅ within the round control logic 326 given the values of the input control variables L₃, L₄, G₃, and G₄ and the internal control variable X. For example, if L₃, L₄, G₃, and G₄ are all true, then G and L are False and True. As another example, if G₃ or X is True, then G₅ is True; otherwise G₅ is False. As described above, G₅ becomes the least significant bit of the 25 bit mantissa m₅. The internal control variable X used to produce G₅ is generated according to TABLE XI below.

TABLE X Truth Table for Generation of G, L and G₅ within Round Control Logic 326 (FIG. 4); L = L₃ {circumflex over ( )} L₄ {circumflex over ( )} (G₃ & G₄); G = G₃ {circumflex over ( )} G₄; G₅ = G₃ | X where {circumflex over ( )} = EXCLUSIVE-OR; & = AND; and | = OR L₃ L₄ G₃ G₄ G L X G₅ False False False False False False False False False False False True True False False False False False True False True False False True False False True True False True False True False True False False False True False False False True False True True True False False False True True False True True False True False True True True False False False True True False False False False True False False True False False True True True False False True False True False True True False True True False True True False False False True True True False False False False False False True True False True True False False False True True True False True False False True True True True True False True False True False False False False False False True True False False False True True False True True False False True False True False True True False False True True False True True True False True False False False True True True False True False True True True True True False True True False True True True True False True True True False False True True True False False False False True True True True False False True True True True True True False True False True True True True True False True True False False True True True True False False False False True True True True False True True False True True True True True False True False True True True True True True False True True True

TABLE XI is a truth table for generation of the control variables GEN and PROP and the internal control variable X within the round control logic 326 given the values of the internal control variables L and G shown in TABLE X and of the input control variables SUB, R₄, and S₄. For example, if L, G, R₄, S₄, and SUB are all True, then GEN and PROP are both True and X is False. The control variables GEN and PROP are input to the carry logic 328. TABLE XI also explains the generation of the signal Cin within the carry logic 328 given the values of the control variables GEN and PROP from the round control logic 326. Similarly, TABLE XII is a truth table for generation of the signal Cin within the carry logic 328 given the values of the control variables GEN and PROP and the signal Cout from the adder stage 314. Cout is the most significant carry bit of the adder stage 214. For example, if GEN is False and PROP is True, then Cin follows the value of Cout. If GEN and PROP are both False, then Cin is False. Finally, if GEN is True, then Cin is True.

TABLE XI Truth Table for Generation of X, GEN, PROP within Round Control Logic 326 and Cin within Carry Logic 328 (FIG. 4); X = L & ~G & R₄ & S₄ & SUB; GEN = ~X & R₄ & (G | S₄ | SUB) | G & S₄ & SUB; PROP = G & (L | S₄ | SUB) | X where & = AND; | = OR; and ~ = NOT L G R₄ S₄ SUB X GEN PROP Cin False False False False False False False False False False False False False True False False False False False False False True False False False False False False False False True True False False False False False False True False False False False False False False False True False True False True False True False False True True False False True False True False False True True True False True False True False True False False False False False False False False True False False True False False True Cout False True False True False False False True Cout False True False True True False True True True False True True False False False True False True False True True False True False True True True False True True True False False True True True False True True True True False True True True True False False False False False False False False True False False False True False False False False True False False True False False False False False True False False True True False False False False True False True False False False False False False True False True False True False True False True True False True True False False True False True True False True True True True False True Cout True True False False False False False True Cout True True False False True False False True Cout True True False True False False False True Cout True True False True True False True True True True True True False False False True True True True True True False True False True True True True True True True False False True True True True True True True True False True True True

TABLE XII Truth Table for Generation of Cin within Carry Logic 328 (FIG. 4); GEN PROP Cout Cin False False False False False False True False False True False False False True True True True False False True True False True True True True False True True True True True Cin = GEN | (PROP & Cout) where & = AND; | = OR

The adder stage 314 receives the 25 bit mantissa m₇, the 25 bit mantissa m₄, and the Cin bit signal and adds these together to produce a 25 bit mantissa m₈. The most significant carry bit Cout of the adder stage 314 is fed back to the carry logic 328 as described above. Thus, the input carry bit Cin to the adder stage 314 is a function of the carry bit Cout of the adder stage 314. Next, the most significant bit of m₈, m₈[24], is complemented by the inverter 330 and returned as the new most significant bit to form a mantissa m₉ that serves as an input to the normalizer stage 316.

Processing continues to the normalizer stage 316, which receives the 25 bit mantissa m₉. The count up to e₁ leading zeros stage 320 examines each bit of the mantissa m₉ beginning with the most significant bit m₉[24] and counts logic zeros until the stage 320 counts e₁ leading zeros, until the stage 320 encounters a logic one, or until the 25 bits of the mantissa m₉ are exhausted, whichever comes first. The stage 320 outputs a control variable LSHIFT that is equal to the number of counted leading logic zeros in the mantissa m₉ The left shifter 318 receives and shifts the bits of the 25 bit mantissa m₉ to the left to produce a 25 bit mantissa m₁₀ according to the value of the control variable, LSHIFT. Accordingly, if LSHIFT is equal to zero, the mantissa m₉ is not shifted and the mantissa m₁₀ equals the mantissa m₉. If LSHIFT is greater than zero, then LSHIFT logic zeros are shifted in to form the latter part of the mantissa m₁₀.

Processing of the mantissa m₁₀ continues downward with the removal of G₁₀ from the mantissa m₁₀. G₁₀ represents the least significant bit m₁₀[0] of the mantissa m₁₀. Next, the most significant bit of the resulting 24 bit mantissa is removed to produce the 23 bit mantissa m of the floating point number f_(result) output of the FADD 300.

The subtract stage 322 subtracts the 8 bit control variable LSHIFT from the 8 bit exponent field value e₁ and produces an 8 bit output that is in turn sent to the increment adder stage 324. The increment adder stage 324 adds the 8 bit output of the subtract stage 322 to the one bit control variable ADD to yield an 8 bit output. The count up to e₁ leading zeros stage 320 also outputs a control variable NOTZERO that is True if the mantissa m₉ is not equal to zero and False if m₉ is equal to zero. The eight AND gates 332 each receive a respective bit of the 8 bit output of the increment adder stage 324 along with the control variable NOTZERO. If the mantissa m₉ is nonzero, then NOTZERO is True and the 8 bit output of the increment adder stage 324 is passed through the eight AND gates 332 to produce the 8 bit exponent field e of the floating point number f_(result). If the mantissa m₉ is zero, then NOTZERO is False, the outputs of the eight AND gates 332 are zero, and the 8 bit exponent field e is zero. The sign bit s₁ of the floating point number f₁ becomes the sign bit s of the floating point number f_(result). All parts s, e, and m of the floating point number f_(result) are thus known and processing of the FADD 300 terminates.

EXAMPLE A

An example that demonstrates the operation of the FADDs 100, 200, 300 according to the embodiments is now described. The swapper stage 102 receives two floating point numbers, i₁ and i₀, and compares the numbers to determine their relative size. The number that is less than or equal to the other number is designated f₀. The floating point number f₀ has the following values:

Decimal value: 8388609 = 2²³ + 1, s₀ = 0, e₀ = 1 0 0 1 0 1 1 0 = 150, and Bit 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m_(f0) = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1.

The floating point number f₁ has the following values:

Decimal value: 8388610 = 2²³ + 2, s₁ = 0, e₁ = 1 0 0 1 0 1 1 0 = 150, and Bit 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m_(f1) = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0.

The ADD and SUB control variables are calculated: ADD=(s₀==s₁)=(0==0)=1, indicating an addition operation, and SUB=˜ADD=˜(1)=0.

EXAMPLE A First Embodiment

The floating point numbers f₁ and f₀, including m₁=m_(f1) and m₀=m_(f0), are processed by the unpack stages 104, 106, respectively, so that on the left-hand side of FIG. 1, the sign bit s₁ and the eight bit exponent field e₃=e₁ are removed from f₁, leaving a 25 bit adjusted mantissa m₃,

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₃ = 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 and on the right-hand side of FIG. 1, the sign bit s₀ and the eight bit exponent field e₂=e₀ are removed from f₀, leaving a 25 bit adjusted mantissa m₂:

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₂ = 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1.

Processing of the mantissa m₃ continues downward with the introduction of two control variables, K₃=m₃[1]=1 and L₃=m₃[0]=0 to the adder 130.

Processing continues and the right shifter 108 receives and shifts the bits of the 25 bit mantissa m₂ to the right according to the value of the following control variable, RSHIFT RSHIFT=e ₃ −e ₂=(1 0 0 1 0 1 1 0)−(1 0 0 1 0 1 1 0)=0 0 0 0 0 0 0 0. Since RSHIFT is equal to zero, the mantissa m₂ is not shifted. The right shifter 108 produces a 25 bit mantissa m₄

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₄ = 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 as well as a series of control variables K₄, L₄, G₄, R₄, and S₄. By inspection of TABLE I, K₄=m₂[1]=m₄[1]=0, L₄=m₂[0]=m₄[0]=1, G₄=R₄=S₄=0.

At the complement stage 112, SUB is False since ADD is True and an addition is being performed and none of the inputs to the complement stage 112 are complemented. The operation of the complement stage 112 is summarized as follows:

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₆ = 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 K₆=m₆[1]=0, L₆=m₆[0]=1, G₆=R₆=S₆=0.

The adder 132 receives the control variable SUB and the input control variables G₆, R₆, and S₆, and, according to TABLE II, generates: G₈=R₈=S₈=0, and Cin=0.

The adder 130 receives the values of Cin from the adder 132 and of the pairs of input control variables K₃, L₃ and K₆, L₆, and, according to TABLE III, generates: K₈=L₈=1

The adder stage 114 receives the 25 bit mantissa m₃, the 25 bit mantissa m₆, and the Cin bit signal and adds these together to produce a 25 bit mantissa m₇. The carry out bit of the adder stage 114 is discarded and is not used to obtain the final result of the FADD 100.

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 Carry 1 m₃ = 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 m₆ = 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 Cin 0 m₇ = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1

Processing continues to the normalizer stage 116, which receives the 25 bit mantissa m₇ and the control variable G₈ from the adder 132. The control variable LSHIFT is equal to the number of counted leading logic zeros in the mantissa m₇ and is therefore zero. Since LSHIFT is equal to zero, the mantissa m₇ is not shifted and the mantissa m₁₁ equals the mantissa m₇

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₁₁ = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1.

The control variables K₈ and L₈ join with G₈, R₈, and S₈ to form a 5 bit word that is input to the left shifter 134: K₈L₈G₈R₈S₈=1 1 0 0 0.

The shifter 134 receives the 5 bit word consisting of the control variables K₈, L₈, G₈, R₈, and S₈ and shifts the bits of the 5 bit word to the left to produce a 5 bit word that consists of the control variables K₁₀, L₁₀, G₁₀, R₁₀, and S₁₀, according to the value of the control variable, LSHIFT. Since LSHIFT=0, there is no shift and, according to TABLE IV, the 5 bit word is equal to K₁₀L₁₀G₁₀R₁₀S₁₀=K₈L₈G₈R₈S₈=1 1 0 0 0.

Next, the round control logic 126 receives the control variables K₁₀, L₁₀, G₁₀, R₁₀, and S₁₀, and, according to TABLE V, generates: INC=1. The signal INC serves as a carry input to the rounding stage 128.

Processing of the mantissa m₁₁ continues downward with the removal of the least significant bit m₁₁[0] from the mantissa m₁₁ to produce a 24 bit mantissa m₁₂

Bit 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₁₂ = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1.

The rounding stage 128 adds the signal INC to the mantissa m₁₂ to produce a 24 bit mantissa m₁₃

Bit 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₁₃ = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0.

Next, the most significant bit of the 24 bit mantissa m₁₃ is removed to produce the 23 bit mantissa m

Bit 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 of the floating point number f_(result) output of the FADD 100. The most significant bit msb=1 serves as an input to the increment adder stage 124.

The subtract stage 122 subtracts the 8 bit control variable LSHIFT 00000000 from the 8 bit exponent field value e₃ 10010110 from the unpack stage 104 and produces an 8 bit output 10010110 that is in turn sent to the increment adder stage 124. The increment adder stage 124 adds the 8 bit output 10010110 of the subtract stage 122 to the one bit most significant bit msb=1 to produce the 8 bit exponent field e 10010111 of the floating point number f_(result). The sign bit s₁=0 of the floating point number f₁ becomes the sign bit s of the floating point number f_(result). All parts s, e, and m of the floating point number f_(result) are thus known and processing of the FADD 100 terminates.

EXAMPLE A Second Embodiment

The floating point numbers f₁ and f₀, including m₁=m₀ and m₁=m_(f0), are processed by the unpack stages 104, 106, respectively, so that on the left-hand side of FIG. 2, the sign bit s₁ and the eight bit exponent field e₃=e₁ are removed from f₁, leaving a 25 bit adjusted mantissa m₃,

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₃ = 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 and on the right-hand side of FIG. 2, the sign bit s₀ and the eight bit exponent field e₂=e₀ are removed from f₀, leaving a 25 bit adjusted mantissa m₂:

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₂ = 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1.

Processing of the mantissa m₃ continues downward with the introduction of two control variables, J₃=m₃[24]=0, K₃=m₃[1]=1, and L₃=m₃[0]=0 to the round control logic 226.

Processing continues and the right shifter 208 receives and shifts the bits of the 25 bit mantissa m₂ to the right according to the value of the following control variable, RSHIFT RSHIFT=e ₃ −e ₂=(1 0 0 1 0 1 1 0)−(1 0 0 1 0 1 1 0)=0 0 0 0 0 0 0 0. Since RSHIFT is equal to zero, the mantissa m₂ is not shifted. The right shifter 208 produces a 25 bit mantissa m₄

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₄ = 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 as well as a series of control variables J₄, K₄, L₄, G₄, R₄, and S₄. By inspection of TABLE I, J₄=m₂[24]=m₄[24]=0, K₄=m₂[1]=m₄[1]=0, L₄=m₂[0]=m₄[0]=1, and G₄=R₄=S₄=0.

At the complement stage 212, SUB is False since ADD is True and an addition is being performed and none of the inputs to the complement stage 212 are complemented. The operation of the complement stage 212 is summarized as follows:

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₆ = 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 J₆=m₆[24]=0, K₆=m₆[1]=0, L₆=m₆[0]=1, G₆=R₆=S₆=0.

The round control logic 226 receives the control variable SUB and the input control variables J₃, K₃, L₃, J₆, K₆, L₆, G₆, R₆, and S₆, and, according to TABLES VI and VII, generates: G₈=Don't Care, GEN=True=1, and PROP=True=1.

The control variables GEN and PROP and the signal C23 from the adder stage 214 are input to the carry logic 228, which, according to TABLES VII and VIII, generates Cin=True=1. In this example, Cin does not depend on the value of C23 from the adder stage 214.

The adder stage 214 receives the 25 bit mantissa m₃, the 25 bit mantissa m₆, and the Cin bit signal and adds these together to produce a 25 bit mantissa m₇. The second most significant carry bit C23 of the adder stage 214 is fed back to the carry logic 228.

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 Carry 1 0 1 1 m₃ = 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 m₆ = 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 Cin 1 m₇ = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 C 23=CARRY BIT(m ₃[23]+m ₆[23]+C22)=CARRY BIT(1+1+0)=1.

Processing continues to the normalizer stage 216, which receives the 25 bit mantissa m₇ and the control variable G₈ from the round control logic 226. The control variable LSHIFT is equal to the number of counted leading logic zeros in the mantissa m₇ and is therefore zero. Since LSHIFT is equal to zero, the mantissa m₇ is not shifted and the mantissa m₁₀ equals the mantissa m₇

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₁₀ = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0.

Processing of the mantissa m₁₀ continues downward with the removal of the least significant bit m₁₀[0] from the mantissa m₁₀. Next, the most significant bit of the resulting 24 bit mantissa is removed to produce the 23 bit mantissa m

Bit 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 of the floating point number f_(result) output of the FADD 200. The most significant bit msb=1 serves as an input to the increment adder stage 224.

The subtract stage 222 subtracts the 8 bit control variable LSHIFT 00000000 from the 8 bit exponent field value e₃ 10010110 from the unpack stage 104 and produces an 8 bit output 10010110 that is in turn sent to the increment adder stage 224. The increment adder stage 224 adds the 8 bit output 10010110 of the subtract stage 222 to the one bit most significant bit msb=1 to produce the 8 bit exponent field e 10010111 of the floating point number f_(result). The sign bit s₁=0 of the floating point number f₁ becomes the sign bit s of the floating point number f_(result). All parts s, e, and m of the floating point number f_(result) are thus known and processing of the FADD 200 terminates.

EXAMPLE A Third Embodiment

On the left-hand side of FIG. 4, the sign bit Si and the eight bit exponent field e₁ are removed from the floating point number f₁, leaving the 23 bit mantissa m_(f1). Processing of the mantissa m_(f1) continues downward with the introduction of a guard bit G₁ having a value of logic zero as the new least significant bit and an implicit one bit as the new most significant bit, producing a 25 bit mantissa m₁

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₁ = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0. and on the right-hand side of FIG. 4, the sign bit s₀ and the eight bit exponent field e₀ are removed from the floating point number f₀, leaving the 23 bit mantissa m_(f0). Processing of the mantissa m_(f0) continues downward with the introduction of an implicit one bit as the new most siginificant bit, producing a 24 bit mantissa m₀

Bit 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₀ = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1.

On the left-hand side of FIG. 4, processing continues at the second right shifter 304, which receives the control variable ADD. ADD is True, so the second right shifter 304 shifts the mantissa m₁ to the right by one to produce a mantissa m₃

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₃ = 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0.

Processing of the mantissa m₃ continues downward with the introduction of two control variables, L₃=m₃[1]=1, and G₃=m₃[0]=0 to the round control logic 326.

Processing continues and the first right shifter 308 receives and shifts the bits of the 25 bit mantissa m₀ to the right according to the value of the following control variable, RSHIFT RSHIFT=e ₃ −e ₂ +ADD=(1 0 0 1 0 1 1 0)−(1 0 0 1 0 1 1 0)+(1)=0 0 0 0 0 0 0 1. Since RSHIFT is equal to one, each bit of the mantissa m₀ is shifted to the right by one. The first right shifter 308 produces a 25 bit mantissa m₂

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₂ = 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 as well as a series of control variables L₂, G₂, R₂, and S₂. By inspection of TABLE IX, L₂=m₀[1]=m₂[1]=0, G₂=m₀[0]=m₂[0]=1, R₂=S₂=0.

At the complement stage 312, SUB is False since ADD is True and an addition is being performed and none of the inputs to the complement stage 312 are complemented. The operation of the complement stage 312 is summarized as follows:

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₄ = 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 L₄=m₄[1]=0, G₄=m₄[0]=1, R₄=S₄=0.

The round control logic 326 receives the control variable SUB and the input control variables L₃, G₆, L₄, G₄, R₄, and S₄, and, according to TABLES X and XI, generates: G₅=False=0, GEN=False=0, and PROP=True=1.

The control variables GEN and PROP and the signal Cout from the adder stage 314 are input to the carry logic 328, which, according to TABLES XI and XII, generates Cin=Cout. In this example, Cin follows the value of Cout from the adder stage 314.

Next, the guard bit G₃ of m₃, that is, m₃[0]=0, is removed and a new guard bit G₅=0 generated from the round control logic 326 is added as the new least significant bit to produce a mantissa m₅

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₅ = 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0.

The most significant bit of m₅, m₅[24], is complemented by the inverter 306 and returned. as the new most significant bit to form a mantissa m₇

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₇ = 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0. that serves as an input to the adder stage 314.

The adder stage 314 receives the 25 bit mantissa m₇, the 25. bit mantissa m₄, and the Cin bit signal and adds these together to produce a 25 bit mantissa m₈. The most significant carry bit Cout of the adder stage 314 is fed back to the carry logic 328. In order to calculate Cout from the adder stage 314, since Cin follows the value of Cout, an initial value of logic zero is assumed for Cin. If Cout is found to be equal to a logic one when the sum is performed, then Cin is adjusted to a logic one and the sum is performed again. The following illustrates the final sum, once Cin is found to be a logic one.

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 Carry 1 1 1 m₇ = 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 m₄ = 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 Cin 1 m₈ = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 Cout=CARRY BIT(m ₇[24]+m ₄[24]+C23)=CARRY BIT(1+0+1)=C24=1

Next, the most significant bit of m₈, m₈[24], is complemented by the inverter 330 and returned as the new most significant bit to form a mantissa m₉ that serves as an input to the normalizer stage 316

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₉ = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0.

Processing continues to the normalizer stage 316, which receives the 25 bit mantissa m₉. The control variable. LSHIFT is equal to the number of counted leading logic zeros in the mantissa m₉ and is therefore zero. Since LSHIFT is equal to zero, the mantissa m₉ is not shifted and the mantissa m₁₀ equals the mantissa m₉

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₁₀ = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0.

Processing of the mantissa m₁₀ continues downward with the removal of the least significant bit G₁₀ from the mantissa m₁₀. Next, the most significant bit of the resulting 24 bit mantissa is removed to produce the 23 bit mantissa m

Bit 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 of the floating point number f_(result) output of the FADD 300.

The subtract stage 322 subtracts the 8 bit control variable LSHIFT 00000000 from the 8 bit exponent field value e₁ 10010110 and produces an 8 bit output 10010110 that is in turn sent to the increment adder stage 324. The increment adder stage 324 adds the 8 bit output 10010110 of the subtract stage 322 to the one bit control variable ADD=1 to produce the 8 bit exponent field e 10010111 of the floating point number f_(result). The sign bit s₁=0 of the floating point number f₁ becomes the sign bit s of the floating point number f_(result). All parts s, e, and m of the floating point number f_(result) are thus known and processing of the FADD 300 terminates.

EXAMPLE B

Another example that demonstrates the operation of the FADDs 100, 200, 300 according to the embodiments is now described. The swapper stage 102 receives two floating point numbers, i₁ and i₀, and compares the numbers to determine their relative size. The number that is less than or equal to the other number is designated f₀. The floating point number f₀ has the following values:

Decimal value: −8388605.5 = −(2²³) + 2.5, s₀ = 1, e₀ = 1 0 0 1 0 1 0 1 = 149, and Bit 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m_(f0) = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1.

The floating point number f₁ has the following values:

Decimal value: 16777215 = 2²⁴ − 1, s₁ = 0, e₁ = 1 0 0 1 0 1 1 0 = 150, and Bit 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m_(f1) = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1. The ADD and SUB control variables are calculated: ADD=(s₀==s₁)=(1==0)=0, indicating a subtraction operation, and SUB=˜ADD=˜(0)=1.

EXAMPLE B First Embodiment

The floating point numbers f₁ and f₀, including m₁=m_(f1) and m₀=m_(f0), are processed by the unpack stages 104, 106, respectively, so that on the left-hand side of FIG. 1, the sign bit s₁ and the eight bit exponent field e₃=e₁ are removed from f₁, leaving a 25 bit adjusted mantissa m₃,

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₃ = 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 and on the right-hand side of FIG. 1, the sign bit s₀ and the eight bit exponent field e₂=e₀ are removed from f₀, leaving a 25 bit adjusted mantissa m₂:

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8  7 6 5 4 3 2 1 0 m₂ = 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1.

Processing of the mantissa m₃ continues downward with the introduction of two control variables, K₃=m₃[1]=1 and L₃=m₃[0]=1 to the adder 130.

Processing continues and the right shifter 108 receives and shifts the bits of the 25 bit mantissa m₂ to the right according to the value of the following control variable, RSHIFT RSHIFT=e ₃ −e ₂=(1 0 0 1 0 1 1 0)−(1 0 0 1 0 1 0 1)=0 0 0 0 0 0 0 1. Since RSHIFT is equal to one, the right shifter 108 shifts the bits of the mantissa m₂ to the right by one, producing a 25 bit mantissa m₄

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8  7 6 5 4 3 2 1 0 m₄ = 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 as well as a series of control variables K₄, L₄, G₄, R₄, and S₄. By inspection of TABLE I, with RSHIFT equal to one, K₄=m₂[2]=m₄[1]=0, L₄=m₂[1]=m₄[0]=1, G₄=m₂[0]=1, R₄=S₄=0.

At the complement stage 112, SUB is True since ADD is False and a subtraction is being performed and so the inputs to the complement stage 112 are complemented. The operation of the complement stage 112 is summarized as follows:

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8  7 6 5 4 3 2 1 0 m₆ = 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 K₆=m₆[1]=1, L₆=m₆[0]=0, G₆=0, R₆=S₆=1.

The adder 132 receives the control variable SUB and the input control variables G₆, R₆, and S₆, and, according to TABLE II, generates: G₈=1, R₈=S₈=0, and Cin=0.

The adder 130 receives the values of Cin from the adder 132 and of the pairs of input control variables K₃, L₃ and K₆, L₆, and, according to TABLE III, generates: K₈=0, L₈=1.

The adder stage 114 receives the 25 bit-mantissa m₃, the 25 bit mantissa m₆, and the Cin bit signal and adds these together to produce a 25 bit mantissa m₇. The carry out bit of the adder stage 114 is discarded and is not used to obtain the final result of the FADD 100.

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 Carry 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m₃ = 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m₆ = 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 Cin 0 m₇ = 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1

Processing continues to the normalizer stage 116, which receives the 25 bit mantissa m₇ and the control variable G₈ from the adder 132. The control variable LSHIFT is equal to the number of counted leading logic zeros in the mantissa m₇ and is therefore one. Since LSHIFT is equal to one, the left shifter 118 shifts the bits of the mantissa m₇ to the left by one and brings in the control variable G₈=1, producing the mantissa m₁₁

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8  7 6 5 4 3 2 1 0 m₁₁ = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1.

The control variables K₈ and L₈ join with G₈, R₈, and S₈ to form a 5 bit word that is input to the left shifter 134: K₈ L₈ G₈ R₈ S₈=0 1 1 0 0.

The shifter 134 receives the 5 bit word consisting of the control variables K₈, L₈, G₈, R₈, and S₈ and shifts the bits of the 5 bit word to the left to produce a 5 bit word that consists of the control variables K₁₀, L₁₀, G₁₀, R₁₀, and S₁₀, according to the value of the control variable, LSHIFT, which in this case is equal to one. According to TABLE IV, the 5 bit word is equal to K₁₀ L₁₀ G₁₀ R₁₀ S₁₀=L₈ G₈ R₈ S₈ False=1 1 0 0 0.

Next, the round control logic 126 receives the control variables K₁₀, L₁₀, G₁₀, R₁₀, and S₁₀, and, according to TABLE V, generates: INC=1. The signal INC serves as a carry input to the rounding stage 128.

Processing of the mantissa m₁₁ continues downward with the removal of the least significant bit m₁₁[0] from the mantissa m₁₁ to produce a 24 bit mantissa m₁₂

Bit 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8  7 6 5 4 3 2 1 0 m₁₂ = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1.

The rounding stage 128 adds the signal INC to the mantissa m₁₂ to produce a 24 bit mantissa m₁₃

Bit 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8  7 6 5 4 3 2 1 0 m₁₃ = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0.

Next, the most significant bit of the 24 bit mantissa m₁₃ is removed to produce the 23 bit mantissa m

Bit 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8  7 6 5 4 3 2 1 0 m = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 of the floating point number f_(result) output of the FADD 100. The most significant bit msb=1 serves as an input to the increment adder stage 124.

The subtract stage 122 subtracts the 8 bit control variable LSHIFT 00000001 from the 8 bit exponent field value e₃ 10010110 from the unpack stage 104 and produces an 8 bit output 10010101 that is in turn sent to the increment adder stage 124. The increment adder stage 124 adds the 8 bit output 10010101 of the subtract stage 122 to the one bit most significant bit msb=1 to produce the 8 bit exponent field e 10010110 of the floating point number f_(result). The sign bit s₁=0 of the floating point number f₁ becomes the sign bit s of the floating point number f_(result). All parts s, e, and m of the floating point number f_(result) are thus known and processing of the FADD 100 terminates.

EXAMPLE B Second Embodiment

The floating point numbers f₁ and f₀, including m₁=m_(f1) and m₀=m_(f0), are processed by the unpack stages 104, 106, respectively, so that on the left-hand side of FIG. 2, the sign bit s₁ and the eight bit exponent field e₃=e₁ are removed from f₁, leaving a 25 bit adjusted mantissa m₃,

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8  7 6 5 4 3 2 1 0 m₃ = 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 and on the right-hand side of FIG. 2, the sign bit s₀ and the eight bit exponent field e₂=e₀ are removed from f₀, leaving a 25 bit adjusted mantissa m₂:

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8  7 6 5 4 3 2 1 0 m₂ = 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1.

Processing of the mantissa m₃ continues downward with the introduction of two control variables, J₃=m₃[24]=0, K₃=m₃[1]=1, and L₃=m₃[0]=1 to the round control logic 226.

Processing continues and the right shifter 208 receives and shifts the bits of the 25 bit mantissa m₂ to the right according to the value of the following control variable, RSHIFT RSHIFT=e ₃ −e ₂=(1 0 0 1 0 1 1 0)−(1 0 0 1 0 1 0 1)=0 0 0 0 0 0 0 1. Since RSHIFT is equal to one, the right shifter 208 shifts the bits of the mantissa m₂ to the right by one, producing a 25 bit mantissa m₄

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₄ = 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 as well as a series of control variables J₄, K₄, L₄, G₄, R₄, and S₄. By inspection of TABLE I, with RSHIFT equal to one, J₄=m₄[24]=0, K₄=m₂[2]=m₄[1]=0, L₄=m₂[1]=m₄[0]=1, G₄=m₂[0]=1 and R₄=S₄=0.

At the complement stage 212, SUB is True since ADD is False and a subtraction is being performed and so the inputs to the complement stage 212 are complemented. The operation of the complement stage 212 is summarized as follows:

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₆ = 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 J₆=m₆[24]=1, K₆=m₆[1]=1, L₆=m₆[0]=0, G₆=0, R₆=S₆=1.

The round control logic 226 receives the control variable SUB and the input control variables J₃, K₃, L₃, J₆, K₆, L₆, G₆, R₆, and S₆, and, according to TABLES VI and VII, generates: G₈=True, GEN=False=0, and PROP=True=1.

The control variables GEN and PROP and the signal C23 from the adder stage 214 are input to the carry logic 228, which, according to TABLES VII and VIII, generates Cin=C23. In this example, Cin follows the value of C23 from the adder stage 214.

The adder stage 214 receives the 25 bit mantissa m₃, the 25 bit mantissa m₆, and the Cin bit signal and adds these together to produce a 25 bit mantissa m₇. The second most significant carry bit C23 of the adder stage 214 is fed back to the carry logic 228. In order to calculate C23 from the adder stage 214, since Cin follows the value of C23, an initial value of logic zero is assumed for Cin. If C23 is found to be equal to a logic one when the sum is performed, then Cin is adjusted to a logic one and the sum is performed again. The following illustrates the final sum, once Cin is found to be a logic one.

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 Carry 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m₃ = 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m₆ = 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 Cin 1 m₇ = 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 C23=CARRY BIT(m ₃[23]+m ₆[23]+C22)=CARRY BIT(1+1+1)=1.

Processing continues to the normalizer stage 216, which receives the 25 bit mantissa m₇ and the control variable G₈ from the round control logic 226. The control variable LSHIFT is equal to the number of counted leading logic zeros in the mantissa m₇ and is therefore one. Since LSHIFT is equal to one, the left shifter 218 shifts the bits of the mantissa m₇ to the left by one and brings in the control variable G₈=1, producing the mantissa m₁₀

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₁₀ ₌ 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1

Processing of the mantissa m₁₀ continues downward with the removal of the least significant bit m₁₀[0] from the mantissa m₁₀. Next, the most significant bit of the resulting 24 bit mantissa is removed to produce the 23 bit mantissa m

Bit 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 of the floating point number f_(result) output of the FADD 200. The most significant bit msb=1 serves as an input to the increment adder stage 224.

The subtract stage 222 subtracts the 8 bit control variable LSHIFT 00000001 from the 8 bit exponent field value e₃ 10010110 from the unpack stage 104 and produces an 8 bit output 10010101 that is in turn sent to the increment adder stage 224. The increment adder stage 224 adds the 8 bit output 10010101 of the subtract stage 222 to the one bit most significant bit msb=1 to produce the 8 bit exponent field e 10010110 of the floating point number f_(result). The sign bit s₁=0 of the floating point number f₁ becomes the sign bit s of the floating point number f_(result). All parts s, e, and m of the floating point number f_(result) are thus known and processing of the FADD 200 terminates.

EXAMPLE B Third Embodiment

On the left-hand side of FIG. 4, the sign bit s₁ and the eight bit exponent field e₁ are removed from the floating point number f₁, leaving the 23 bit mantissa m_(f1). Processing of the mantissa m_(f1) continues downward with the introduction of a guard bit G₁ having a value of logic zero as the new least significant bit and an implicit one bit as the new most significant bit, producing a 25 bit mantissa m₁

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₁ = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 and on the right-hand side of FIG. 4, the sign bit s₀ and the eight bit exponent field e₀ are removed from the floating point number f₀, leaving the 23 bit mantissa m_(f0). Processing of the mantissa m_(f0) continues downward with the introduction of an implicit one bit as the new most siginificant bit, producing a 24 bit mantissa m₀

Bit 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₀ = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1

On the left-hand side of FIG. 4, processing continues at the second right shifter 304, which receives the control variable ADD. ADD is False, so the second right shifter 304 does not shift the mantissa m₁ and produces a mantissa m₃

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₃ = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 that is equal to the mantissa m₁.

Processing of the mantissa m₃ continues downward with the introduction of two control variables, L₃=m₃[1]=1, and G₃=m₃[0]=0 to the round control logic 326.

Processing continues and the first right shifter 308 receives and shifts the bits of the 25 bit mantissa m₀ to the right according to the value of the following control variable, RSHIFT RSHIFT=e ₃ −e ₂ +ADD=(1 0 0 1 0 1 1 0)−(1 0 0 1 0 1 0 1)+(0)=0 0 0 0 0 0 0 1. Since RSHIFT is equal to one, each bit of the mantissa m₀ is shifted to the right by one. The first right shifter 308 produces a 25 bit mantissa m₂

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₂ = 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 as well as a series of control variables L₂, G₂, R₂, and S₂. By inspection of TABLE IX, L₂=m₀[1]=m₂[1]=1, G₂=m₀[0]=m₂[0]=1, R₂=S₂=0.

At the complement stage 312, SUB is True since ADD is False and a subtraction is being performed and so the inputs to the complement stage 312 are complemented. The operation of the complement stage 312 is summarized as follows:

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₄ = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 L₄=m₄[1]=0, G₄=m₄[0]=0, R₄=S₄=1.

The round control logic 326 receives the control variable SUB and the input control variables L₃, G₃, L₄, G₄, P₄, and S₄, and, according to TABLES X and XI, generates: G₅=True=1, GEN=False=0, and PROP=True=1.

The control variables GEN and PROP and the signal Cout from the adder stage 314 are input to the carry logic 328, which, according to TABLES XI and XII, generates Cin=Cout. In this example, Cin follows the value of Cout from the adder stage 314.

Next, the guard bit G₃ of m₃, that is, m₃[0]=0, is removed and a new guard bit G₅=1 generated from the round control logic 326 is added as the new least significant bit to produce a mantissa m₅

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₅ = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

The most significant bit of m₅, m₅[24], is complemented by the inverter 306 and returned as the new most significant bit to form a mantissa m₇

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₇ = 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 that serves as an input to the adder stage 314.

The adder stage 314 receives the 25 bit mantissa m₇, the 25 bit mantissa m₄, and the Cin bit signal and adds these together to produce a 25 bit mantissa m₈. The most significant carry bit Cout of the adder stage 314 is fed back to the carry logic 328. In order to calculate Cout from the adder stage 314, since Cin follows the value of Cout, an initial value of logic zero is assumed for Cin. If Cout is found to be equal to a logic one when the sum is performed, then Cin is adjusted to a logic one and the sum is performed again. The following illustrates the final sum, once Cin is found to be a logic one.

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 Carry 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m₇ = 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m₄ = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 Cin 1 m₈ = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 Cout=CARRY BIT(m ₇[24]+m ₄[24]+C23)=CARRY BIT(0+1+1)=C24=1

Next, the most significant bit of m₈, m₈[24], is complemented by the inverter 330 and returned as the new most significant bit to form a mantissa m₉ that serves as an input to the normalizer stage 316

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₉ = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0

Processing continues to the normalizer stage 316, which receives the 25 bit mantissa m₉. The control variable LSHIFT is equal to the number of counted leading logic zeros in the mantissa m₉ and is therefore zero. Since LSHIFT is equal to zero, the mantissa m₉ is not shifted and the mantissa m₁₀ equals the mantissa m₉

Bit 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m₁₀ = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0

Processing of the mantissa m₁₀ continues downward with the removal of the least significant bit G₁₀ from the mantissa m₁₀. Next, the most significant bit of the resulting 24 bit mantissa is removed to produce the 23 bit mantissa m

Bit 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 m = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 of the floating point number f_(result) output of the FADD 300.

The subtract stage 322 subtracts the 8 bit control variable LSHIFT 00000000 from the 8 bit exponent field value e₁ 10010110 and produces an 8 bit output 10010110 that is in turn sent to the increment adder stage 324. The increment adder stage 324 adds the 8 bit output 10010110 of the subtract stage 322 to the one bit control variable ADD=0 to produce the 8 bit exponent field e 10010110 of the floating point number f_(result). The sign bit s₁=0 of the floating point number f₁ becomes the sign bit s of the floating point number f_(result). All parts s, e, and m of the floating point number f_(result) are thus known and processing of the FADD 300 terminates.

Of course, it should be understood that the floating point adder 100, 200, 300 system configurations, control logic implementations, and connections shown in FIGS. 1-4 are merely intended to be exemplary, and that other configurations, implementations, and connections are possible and may be used as suitable. For example, although the FADDs 100, 200, 300 of FIGS. 1, 2 and 4 are designed for handling single precision (32-bit) floating point numbers in compliance with the IEEE Std 754 round to nearest methodology, the FADDs 100, 200, 300 may be extended to process any size of floating point numbers as suitable, including, for example, double precision (64-bit) floating point numbers.

The 32 bits of a single precision floating point number include one bit for a sign bit, eight bits for an exponent field, and 23 bits for the mantissa. For norm numbers, a bit value of one is understood to precede the 23 bits of the mantissa, becoming in effect, an implicit one most significant bit. A norm number has an exponent field that takes on a value between zero and 255. A denorm number, by contrast, has an implicit zero most significant bit of the mantissa, a mantissa that is not equal to zero, and an exponent field that is equivalent to zero.

One notable difference between the FADDs 100, 200, 300 is that the FADD 300 is not designed to handle denorm numbers, while the FADDs 100, 200 are equipped to handle denorm numbers. Of course, depending on the demands of a particular application, the capability of handling denorm numbers may or may not be necessary. It should be understood that, where necessary or as desired, all embodiments may be easily modified to handle denorm numbers as in FIGS. 1-3 or otherwise modified to handle only norm numbers as in FIG. 4.

Of course, it should be understood that although inverters and complement stages are illustrated at various points in the FADDs 100, 200, 300, a given signal value and the complement of the given signal value are available at all places as suitable, even though inverters and complement stages are illustrated for clarity. For example, the functions performed by the complement stage 312 of FIG. 4 and the inverter 310 could be incorporated into the round control logic 326. Similarly, although certain control variable values overlap with mantissa values, in some instances, such values are illustrated separately for clarity. For example, in FIG. 2, the control variable outputs J₄, K₄, and L₄ of the right shifter 208 are actually equivalent by definition to values within the mantissa m₄ also output by the right shifter 208, these are drawn separately for clarity.

The present invention can be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. Apparatus of the invention can be implemented in a computer program product tangibly embodied in a machine-readable storage device for execution by a programmable processor; and method acts of the invention can be performed by a programmable processor executing a program of instructions to perform functions of the invention by operating on input data and generating output. The invention can be implemented advantageously in one or more computer programs that executable on a programmable system including at least one programmable processor coupled to receive data and instructions from, and to transmit data and instructions to, a data storage system, at least one input device, and at least one output device. Each computer program can be implemented in a high-level procedural or object-oriented programming language, or in assembly or machine language if desired; and in any case, the language can be a compiled or interpreted language. Suitable processors include, by way of example, both general and special purpose microprocessors. Generally, a processor will receive instructions and data from a read-only memory and/or a random access memory. Generally, a computer will include one or more mass storage devices for storing data files; such devices include magnetic disks, such as internal hard disks and removable disks; magneto-optical disks; and optical disks. Storage devices suitable for tangibly embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, such as EPROM, EEPROM, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM disks. Any of the foregoing can be supplemented by, or incorporated in, ASICs (application-specific integrated circuits).

Although the present invention has been particularly described with reference to the preferred embodiments, it should be readily apparent to those of ordinary skill in the art that changes and modifications in the form and details may be made without departing from the spirit and scope of the invention. It is intended that the appended claims include such changes and modifications. 

1. A floating point number adder system to add a first floating point number to a second floating point number, the system comprising: an adder that performs an add operation to add a first mantissa associated with the first floating point number, a second mantissa associated with the second floating point number, and an input bit to produce a third mantissa and an output bit; a round control logic circuit that produces round control data derived from the first mantissa and the second mantissa; a carry logic circuit, coupled to the output bit and the round control logic circuit, that generates the input bit; and a normalizer stage coupled to the adder and adapted to normalize the third mantissa and produce a final mantissa; wherein the third mantissa and the final mantissa are correctly rounded as a result of the add operation performed by the adder.
 2. The system according to claim 1, wherein the round control logic circuit produces the round control data based on a sign control bit associated with the first floating point number and the second floating point number.
 3. The system according to claim 1, wherein the normalizer stage receives a control bit derived from the round control data.
 4. The system according to claim 1, wherein the carry logic circuit receives a plurality of carry logic signals.
 5. The system according to claim 1, wherein a less significant bit of the third mantissa depends on a more significant bit of the second mantissa.
 6. The system according to claim 1, wherein the first mantissa is aligned with the second mantissa prior to adding.
 7. The system according to claim 1, wherein the system shifts a larger or equal floating point number of the first floating point number and the second floating point number by one position to produce the first mantissa, prior to adding, if both of the first and second floating point numbers are positive.
 8. The system according to claim 1, wherein the system shifts in a number of zeroes into a smaller or equal floating point number of the first floating point number and the second floating point number to produce a series of control variables and a fourth mantissa having digits, prior to the adding, if both of the first and second floating point numbers are positive, and complements each digit of the fourth mantissa to produce the second mantissa.
 9. A digital floating point adder comprising: an unpack stage having a first input for a binary representation of a first floating point number, a second input for a binary representation of a second floating point number, a first output for a first mantissa associated with the first floating point number, and a second output for a second mantissa associated with the second floating point number; a round control logic circuit having an input coupled to the first and second outputs of the unpack stage, and an output for round control data generated from the input of the round control circuit; a binary adder having a first input coupled to the first output of the unpack stage, a second input coupled to the second output of the unpack stage, and a third input for receiving an input bit, the adder further having a first output for the sum of the first, second, and third inputs, and a second output for an output bit; a carry logic circuit having a first input coupled to the output of the round control logic, a second input coupled to the second output of the binary adder, and an output coupled to the third input of the binary adder.
 10. A digital floating point adder according to claim 9, wherein the output of the round control logic circuit includes a GEN output and a PROP output, and wherein the output of the carry logic circuit is True if and only if either GEN is True, or both PROP and the output bit of the binary adder are true.
 11. A digital floating point adder according to claim 10, wherein the output bit of the binary adder is a carry bit selected from the group consisting of the most significant carry bit and the second most significant carry bit.
 12. A digital floating point adder according to claim 9, further comprising a normalizer stage having an input coupled to the first output of the binary adder, the normalizer stage being operative to left-shift the first output of the binary adder to remove leading zeros and to generate a normalized mantissa, the normalizer stage having an output operative to remove the least significant bit of the normalized mantissa to generate a final mantissa; wherein the round control logic is operative to generate round control data such that the final mantissa is correctly rounded.
 13. A digital floating point adder according to claim 12, wherein the normalizer stage is not coupled to a rounding stage.
 14. A digital floating point adder according to claim 9, further comprising a complement stage, wherein the input of the round control logic circuit is coupled to the second output of the unpack stage through the complement stage. 